Multithreaded processor with multiple concurrent pipelines per thread

ABSTRACT

A multithreaded processor comprises a plurality of hardware thread units, an instruction decoder coupled to the thread units for decoding instructions received therefrom, and a plurality of execution units for executing the decoded instructions. The multithreaded processor is configured for controlling an instruction issuance sequence for threads associated with respective ones of the hardware thread units. On a given processor clock cycle, only a designated one of the threads is permitted to issue one or more instructions, but the designated thread that is permitted to issue instructions varies over a plurality of clock cycles in accordance with the instruction issuance sequence. The instructions are pipelined in a manner which permits at least a given one of the threads to support multiple concurrent instruction pipelines.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of co-pending U.S. patent application Ser. No. 11/096,917, filed Apr. 1, 2005 and entitled “Multithreaded Processor with Multiple Concurrent Pipelines Per Thread” which claims the priority of U.S. Provisional Application Ser. No. 60/560,199, filed Apr. 7, 2004 and entitled “Processor Pipeline With Multithreaded Support,” both of which are incorporated by reference herein.

The present application is also related to Ser. No. 10/841,261, filed May 7, 2004 and entitled “Processor Reduction Unit for Accumulation of Multiple Operands With or Without Saturation,” now issued as U.S. Pat. No. 7,593,978, which is incorporated by reference herein. The present application is further related to U.S. patent application Ser. No. 12/579,912, filed Oct. 15, 2009 and entitled “Multithreaded Processor with Multiple Concurrent Pipelines per Thread,” which is incorporated by reference herein. The present application is also related to U.S. patent application Ser. No. 12/579,867, filed Oct. 15, 2009 and entitled “Multithreaded Processor with Multiple Concurrent Pipelines per Thread,” which is incorporated by reference herein. The present application is further related to U.S. patent application Ser. No. 12/579,893, filed Oct. 15, 2009 and entitled “Multithreaded Processor with Multiple Concurrent Pipelines per Thread,” which is incorporated by reference herein.

FIELD

The present invention relates generally to the field of digital data processors, and more particularly to multithreading and pipelining techniques for use in a digital signal processor (DSP) or other type of digital data processor.

BACKGROUND

Pipelining is a well-known processor implementation technique whereby multiple instructions are overlapped in execution. Conventional pipelining techniques are described in, for example, John L. Hennessy and David A. Patterson, “Computer Architecture: A Quantitative Approach,” Third Edition, Morgan Kaufmann Publishers, Inc., San Francisco, Calif., 2003.

FIG. 1A shows an example involving the execution of two instructions without any overlap. In this example, the two instructions are an integer add instruction addi r0, r2, 8, and an integer multiplication instruction muli r8, r3, 4. The first instruction, addi, performs an addition of the contents of register r2 and an immediate value 8, and stores the result in register r0. It is assumed for simplicity and clarity of illustration that each of the instructions includes the same four pipeline stages, denoted instruction fetch (IF), read (RD), execute (EX) and writeback (WB).

In the first stage (IF) instructions are fetched from memory and decoded. In the second stage (RD) the operands are read from the register file. In the third stage (EX) the addition is performed. Finally, in the fourth stage (WB) the results are written back into the register file at location r0. When the addi instruction has completed, the next instruction muli is started. The muli instruction performs an addition of the contents of register r3 and an immediate value 4, and stores the result in register r8.

FIG. 1B shows the same two instructions but depicts how they may be overlapped using a conventional pipelining technique. Each of the pipeline stages (IF, RD, EX and WB) is generally executed on a clock boundary. The second instruction, muli, may be started on the second clock cycle without requiring additional hardware. The hardware associated with the IF, RD, EX and WB stages are shared between the two instructions, but the stages of one instruction are shifted in time relative to those of the other.

FIG. 2 illustrates a complication that may arise in a pipeline implementation. In this example, the muli instruction requires as an operand the contents of register r0, and thus cannot read 10 until the addi instruction has computed and written back the result of the addition operation to r0. Processing of the muli instruction begins on the next clock cycle following the start of the addi instruction, but this process must stall and wait for the execution and writeback stages of the addi instruction to complete. The empty cycles the muli instruction must wait for its operands to become available are typically called “bubbles” in the pipeline.

In single-threaded processors, a common method for reducing pipeline bubbles is known as bypassing, whereby instead of writing the computed value back to the register file in the WB stage, the result is forwarded directly to the processor execution unit that requires it. This reduces but does not eliminate bubbles in deeply pipelined machines. Also, it generally requires dependency checking and bypassing hardware, which unduly increases processor cost and complexity.

It is also possible to reduce pipeline stalls through the use of multithreading. Multithreaded processors are processors that support simultaneous execution of multiple distinct instruction sequences or “threads.” Conventional threading techniques are described in, for example, M. J. Flynn, “Computer Architecture: Pipelined and Parallel Processor Design,” Jones and Bartlett Publishers, Boston, Mass., 1995, and G. A. Blaauw and Frederick P. Brooks, “Computer Architecture: Concepts and Evolution,” Addison-Wesley, Reading, Mass., 1997, both of which are incorporated by reference herein.

However, these and other conventional approaches generally do not allow multiple concurrent pipelines per thread, nor do they support pipeline shifting.

Accordingly, techniques are needed which can provide improved pipelining in a multithreaded digital data processor.

SUMMARY

The present invention in an illustrative embodiment provides a multithreaded processor which advantageously allows multiple concurrent pipelines per thread, and also supports pipeline shifting.

In accordance with one aspect of the invention, a multithreaded processor comprises a plurality of hardware thread units, an instruction decoder coupled to the thread units for decoding instructions received therefrom, and a plurality of execution units for executing the decoded instructions. The multithreaded processor is configured for controlling an instruction issuance sequence for threads associated with respective ones of the hardware thread units. On a given processor clock cycle, only a designated one of the threads is permitted to issue one or more instructions, but the designated thread that is permitted to issue instructions varies over a plurality of clock cycles in accordance with the instruction issuance sequence. The instructions are pipelined in a manner which permits at least a given one of the threads to support multiple concurrent instruction pipelines.

In the illustrative embodiment, the instruction issuance sequence is determined using a token triggered threading approach. More specifically, in an arrangement in which the processor supports N threads, over a sequence of N consecutive processor clock cycles each of the N threads is permitted to issue instructions on only a corresponding one of the N consecutive processor clock cycles.

The illustrative embodiment allows each of the threads to issue up to three instructions on its corresponding one of the processor clock cycles. The instructions are pipelined such that at least five separate instruction pipelines can be concurrently executing for different ones of the threads.

The pipelined instructions in the illustrative embodiment include a load/store instruction, an arithmetic logic unit instruction, an integer multiplication instruction, a vector multiplication instruction, and a vector multiplication and reduction instruction.

In accordance with another aspect of the invention, the vector multiplication and reduction instruction is pipelined using a number of stages which is greater than a total number of threads of the processor. For example, the vector multiplication and reduction instruction may comprise a pipeline with at least eleven stages, including an instruction decode stage, a vector register file read stage, at least two multiply stages, at least two add stages, an accumulator read stage, a plurality of reduction stages, and an accumulator writeback stage. The accumulator read stage may be combined with another of the stages, such as an add stage. Pipelines for respective vector multiplication and reduction instructions may be shifted relative to one another by a plurality of pipeline stages.

The present invention in the illustrative embodiment provides a number of significant advantages over conventional techniques. For example, a higher degree of concurrency is provided than that achievable using conventional approaches. Also, the need for dependency checking and bypassing hardware is eliminated, since computation results are guaranteed to be written back to the appropriate register file before they are needed by the next instruction from the same thread. Furthermore, the techniques help to limit processor power consumption.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1A and 1B show examples of instruction execution using conventional approaches.

FIG. 2 illustrates the manner in which stalls can occur in a conventional processor pipeline.

FIG. 3 shows an example of a pipeline of a multithreaded pipelined processor in an embodiment of the invention.

FIG. 4 shows an example of a multithreaded processor in which the present invention may be implemented.

FIG. 5 is a diagram illustrating an example token triggered multithreading approach that may be utilized in an embodiment of the invention.

FIG. 6 shows a number of example pipelines in an embodiment of the invention.

FIG. 7 illustrates the manner in which pipelines can be shifted to permit computation cycles which are longer than issue cycles, in accordance with one embodiment of the invention.

DETAILED DESCRIPTION

The present invention will be described in the context of an exemplary multithreaded processor. It should be understood, however, that the invention does not require the particular arrangements shown, and can be implemented using other types of digital data processors and associated processing circuitry.

A given processor as described herein may be implemented in the form of one or more integrated circuits.

The present invention in an illustrative embodiment provides a pipelining technique suitable for use in a multithreaded processor. With this technique, multiple instructions from multiple threads can be concurrently executed in an efficient manner. As will be described in greater detail below, the illustrative embodiment uses variable length execution pipelines, staggered execution, and rotated start execution, to provide concurrent execution while maintaining low power operation. The illustrative embodiment provides a higher degree of concurrency than that achievable using conventional approaches.

FIG. 3 shows an example of a multithreaded pipeline that removes the “bubbles” that are introduced through pipelined execution. As in the previous examples herein, it is assumed for simplicity and clarity of illustration in this example that the issued instructions each include the same four pipeline stages, namely, IF, RD, EX and WB. It is further assumed that there are three threads, and thus three hardware thread units or “contexts” issuing instructions in a sequential manner. In a typical implementation of a multithreaded processor, a given thread can generally be viewed in terms of hardware as well as software. The particular processor hardware associated with a given thread is therefore more particularly referred to herein as a hardware thread unit or simply a “context.”

In this example, an integer add instruction addi r0, r2, 8 is initially issued by a first one of the contexts on a first clock cycle. The other two contexts issue instructions on respective subsequent clock cycles. It takes a total of three clock cycles for each of the contexts to issue an instruction. On a fourth clock cycle, the first context issues another instruction, namely an integer multiplication instruction muli r8, r0, 4.

More specifically, in cycle 1, the IF stage of thread 1 is executed for the addi instruction. In cycle 2, the IF stage of thread 2 executes while at the same time the RD stage of thread 1 executes. In cycle 3, the IF stage of thread 3 executes, the RD stage of thread 2 executes, and the EX stage of thread 1 executes. In cycle 4, the IF stage of thread 1 of the muli instruction executes concurrently with the WB stage of the addi instruction. Simultaneously, the EX stage of thread 2 executes and the RD stage of thread 3 executes.

It can be seen from this example that multiple instructions from the same and different threads are overlapped and concurrently executing. It can also be seen that there are no bubbles in the pipeline even though the results of the addi instruction are required by the muli instruction. The FIG. 3 example therefore serves to illustrate that with an appropriately-configured pipeline and a sufficient number of threads, all hardware contexts may be executing concurrently even though there is only a single instruction issued per context per cycle. The particular number of threads and pipeline stages are purposes of illustration only, and not intended to reflect a preferred implementation. Those skilled in the art will be readily able to determine an appropriate number of threads and pipeline stages for a particular application given the teachings provided herein.

As indicated previously, the present invention can be advantageously implemented in a multithreaded processor. A more particular example of a multithreaded processor in which the invention may be implemented is described in U.S. Pat. No. 6,968,445 (hereinafter “the '445 Patent”), which is commonly assigned herewith and incorporated by reference herein. This multithreaded processor may be configured to execute RISC-based control code, DSP code, Java code and network processing code. It includes a single instruction multiple data (SIMD) vector processing unit, a reduction unit, and long instruction word (LIW) compounded instruction execution. Examples of threading and pipelining techniques suitable for use with this exemplary multithreaded processor are described in U.S. Pat. No. 6,842,848 (hereinafter “the '848 Patent”), which is commonly assigned herewith and incorporated by reference herein.

The invention can be implemented in other multithreaded processors, or more generally other types of digital data processors. Another such processor will now be described with reference to FIG. 4.

FIG. 4 shows an example of a multithreaded processor 400 incorporating a reduction unit 402 and an accumulator register file 406. The processor 400 is generally similar to that described in the '445 Patent, but incorporates reduction unit 402 and accumulator register file 406 configured as described in the above-cited '978 Patent.

The multithreaded processor 400 includes, among other elements, a multithreaded cache memory 410, a multithreaded data memory 412, an instruction buffer 414, an instruction decoder 416, a register file 418, and a memory management unit (MMU) 420. The multithreaded cache '410 includes a plurality of thread caches 410-1, 410-2, . . . 410-N, where N generally denotes the number of threads supported by the multithreaded processor 400, and in this particular example is given by N=4. Of course, other values of N may be used, as will be readily apparent to those skilled in the art.

Each thread thus has a corresponding thread cache associated therewith in the multithreaded cache 410. Similarly, the data memory 412 includes N distinct data memory instances, denoted data memories 412-1, 412-2, . . . 412-N as shown.

The multithreaded cache 410 interfaces with a main memory (not shown) external to the processor 400 via the MMU 420. The MMU 420, like the cache 410, includes a separate instance for the each of the N threads supported by the processor. The MMU 420 ensures that the appropriate instructions from main memory are loaded into the multithreaded cache 410.

The data memory 412 is also typically directly connected to the above-noted external main memory, although this connection is also not explicitly shown in the figure. Also associated with the data memory 412 is a data buffer 430.

In general, the multithreaded cache 410 is used to store instructions to be executed by the multithreaded processor 400, while the data memory 412 stores data that is operated on by the instructions. Instructions are fetched from the multithreaded cache 410 by the instruction decoder 416 and decoded. Depending upon the instruction type, the instruction decoder 416 may forward a given instruction or associated information to various other units within the processor, as will be described below.

The processor 400 includes a branch instruction queue (IQ) 440 and program counter (PC) registers 442. The program counter registers 442 include one instance for each of the threads. The branch instruction queue 440 receives instructions from the instruction decoder 416, and in conjunction with the program counter registers 442 provides input to an adder block 444, which illustratively comprises a carry-propagate adder (CPA). Elements 440, 442 and 444 collectively comprise a branch unit of the processor 400. Although not shown in the figure, auxiliary registers may also be included in the processor 400.

The register file 418 provides temporary storage of integer results. Instructions forwarded from the instruction decoder 416 to an integer instruction queue (IQ) 450 are decoded and the proper hardware thread unit is selected through the use of an offset unit 452 which is shown as including a separate instance for each of the threads. The offset unit 452 inserts explicit bits into register file addresses so that independent thread data is not corrupted. For a given thread, these explicit bits may comprise, e.g., a corresponding thread identifier.

As shown in the figure, the register file 418 is coupled to input registers RA and RB, the outputs of which are coupled to an arithmetic logic unit (ALU) block 454, which may comprise an adder. The input registers RA and RB are used in implementing instruction pipelining. The output of the ALU block 454 is coupled to the data memory 412.

The register file 418, integer instruction queue 450, offset unit 452, elements RA and RB, and ALU block 454 collectively comprise an exemplary integer unit.

Instruction types executable in the processor 400 include Branch, Load, Store, Integer and Vector/SIMD instruction types. If a given instruction does not specify a Branch, Load, Store or Integer operation, it is a Vector/SIMD instruction. Other instruction types can also or alternatively be used. The Integer and Vector/SIMD instruction types are examples of what are more generally referred to herein as integer and vector instruction types, respectively.

A vector IQ 456 receives Vector/SIMD instructions forwarded from the instruction decoder 416. A corresponding offset unit 458, shown as including a separate instance for each of the threads, serves to insert the appropriate bits to ensure that independent thread data is not corrupted.

A vector unit 460 of the processor 400 is separated into N distinct parallel portions, and includes a vector file 462 which is similarly divided. The vector file 462 includes thirty-two registers, denoted VR00 through VR31. The vector file 462 serves substantially the same purpose as the register file 418 except that the former operates on Vector/SIMD instruction types.

The vector unit 460 illustratively comprises the vector instruction queue 456, the offset unit 458, the vector file 462, and the arithmetic and storage elements associated therewith.

The operation of the vector unit 460 is as follows. A Vector/SIMD block encoded either as a fractional or integer data type is read from the vector file 462 and is stored into architecturally visible registers VRA, VRB, VRC. From there, the flow proceeds through multipliers (MPY) that perform parallel concurrent multiplication of the Vector/SIMD data. Adder units comprising carry-skip adders (CSAs) and CPAs may perform additional arithmetic operations. For example, one or more of the CSAs may be used to add in an accumulator value from a vector register file, and one or more of the CPAs may be used to perform a final addition for completion of a multiplication operation, as will be appreciated by those skilled in the art. Computation results are stored in Result registers 464, and are provided as input operands to the reduction unit 402. The reduction unit 402 sums the input operands in such a way that the summation result produced is the same as that which would be obtained if each operation were executed in series. The reduced sum is stored in the accumulator register file 406 for further processing.

When performing vector dot products, the MPY blocks perform four multiplies in parallel, the CSA and CPA units perform additional operations or simply pass along the multiplication results for storage in the Result registers 464, and the reduction unit 402 sums the multiplication results, along with an accumulator value stored in the accumulator register file 406. The result generated by the reduction unit is then stored in the accumulator register file for use in the next iteration, in the manner previously described.

The accumulator register file 406 in this example includes a total of sixteen accumulator registers denoted ACC00 through ACC 15.

The multithreaded processor 400 may make use of techniques for thread-based access to register files, as described in U.S. Pat. No. 6,904,511 (hereinafter “the '511 Patent”), which is commonly assigned herewith and incorporated by reference herein.

The multithreaded processor 400 is well suited for use in performing vector dot products and other types of parallel vector multiply and reduce operations, as described in the above-cited '978 Patent.

The illustrative embodiment of the present invention utilizes an approach known as token triggered threading. Token triggered threading is described in the above-cited '848 Patent. The token triggered threading typically assigns different tokens to each of a plurality of threads of a multithreaded processor. For example, the token triggered threading may utilize a token to identify in association with a current processor clock cycle a particular one of the threads of the processor that will be permitted to issue an instruction for a subsequent clock cycle.

FIG. 5 shows an example of token triggered threading for an implementation of a multithreaded processor in which the number of threads N is eight. In general, all of the threads operate simultaneously, and each accesses a corresponding instance of the thread cache 110 and data memory 112. As shown in FIG. 5, the eight threads are denoted Thread 0, Thread 1, Thread 2, . . . Thread 7, and are illustrated as being serially interconnected in the form of a ring.

In accordance with the token triggered threading illustrated in FIG. 5, all of the hardware thread units or contexts are permitted to simultaneously execute instructions, but only one context may issue an instruction in a particular clock cycle of the processor. In other words, all contexts execute simultaneously but only one context is active on a particular clock cycle. Therefore, if there are a total of C contexts it will require C clock cycles to issue an instruction from all contexts. Each clock cycle, one of the contexts issues an instruction, and the next thread to issue an instruction is indicated by a token.

In the FIG. 5 example, the tokens are arranged in a sequential or round-robin manner, such that the contexts will issue instructions sequentially. However, tokens indicating the next context to issue an instruction may be arranged using other patterns, such as an alternating even-odd pattern. Also, as noted above, other types of threading may be used in conjunction with the present invention.

Although token triggered threading is used in the illustrative embodiment, the invention does not require this particular type of multithreading, and other types of multithreading techniques can be used.

FIG. 6 illustrates the manner in which example instruction functions may be pipelined in the multithreaded processor 400 in accordance with the present invention. In the illustrative embodiment of the invention, this type of pipelining is preferably utilized in conjunction with the token triggered threading described previously, but it is to be appreciated that numerous other combinations of pipelining and threading may be used in implementing the invention.

The figure depicts example pipelines for Load/Store (Ld/St), Arithmetic Logic Unit (ALU), Integer Multiplication (I_Mul), Vector Multiplication (V_Mul), and Vector Multiplication and Reduction (V_Mul Reduce) instructions. In this implementation, up to three pipelines may be simultaneously started and all five may be in various phases of execution concurrently.

The Ld/St pipeline has nine stages, denoted stage 0 through stage 8. In the first stage, stage 0 (Inst Dec), an instruction is fetched and decoded. This stage is common to all five pipelines and determines which queue the instructions should be routed to. In stage 1 (RF Read), the register file operands are read. This will form the base address for the load or store operation. In the case of a store instruction, the data to be stored is also read. In stage 2 (Agen), any immediate values are added to the address and the full address is generated. In stage 3 (Xfer), the computed address is transferred to the memory subsystem. In stage 4 (Int/Ext), a determination is made as to whether the memory access is to internal or external memory. In stages 5-7 (Mem0, Mem1, Mem2), the value is read from or written to memory. In stage 8 (WB), the value read from memory on a Load instruction is written into the register file.

The ALU pipeline has seven stages, denoted stage 0 through stage 6. As in the Ld/St pipeline, the first stage, stage 0 (Inst Dec), fetches and decodes all instructions. In stage 1 (Wait), a wait cycle is inserted. This allows the Ld/St and ALU hardware to share the same register file read ports. In the following stage, stage 2 (RF Read), the operands for the arithmetic function are read from the register file. Stages 3 and 4 (Exec1, Exec2) then compute the arithmetic result (e.g., an add, compare, shift, etc.). In stage 5 (Xfer), the result is transferred to the register file. In stage 6 (WB), the result is written back into the register file.

The I_Mul pipeline is similar to the ALU pipeline, as they share common architected resources. The figure indicates that the pipeline stages are identical except for an additional execution stage (Exec 3) in the I_Mul pipeline. Thus, an additional cycle is available for computing the result of a multiply.

The V_Mul pipeline uses different architected resources than the previously-described ALU and I_Mul pipelines. It may therefore execute concurrently with those instructions without resource conflicts. Stage 0 (Inst Dec) is as in all instructions and allows for routing of the decoded instruction to the correct pipeline. In stage 1 (VRF Read) the vector register file operands are read. Stages 2-5 (MPY1, MPY2, Add1, Add2) perform the multi-element vector arithmetic. The two add stages are present to convert the multiplication results from carry-save format back into two's complement format. Additionally, if the vectors only require simple arithmetic, this can be performed in the add stages. In stage 6 (Xfer), the results are transferred back to the vector register file, and in stage 7 (WB), the results are written back.

The V_Mul Reduce pipeline is similar to the V_Mul pipeline except that an additional reduction operation is performed. The reduction takes the 4 vector element products, along with an accumulator operand, and reduces them to a single scalar element. Typically this involves adding all of the products to the accumulator or subtracting all of the products from the accumulator, although other combinations are possible. The V_Mul and V_Mul Reduce pipelines are the same until stage 5. In stage 5 (Add2, ACC Read), an additional architected accumulator register file is read. This value is arithmetically combined with the vector elements and reduced to a single scalar. Four stages (Reduce1, Reduce2, Reduce3, Reduce4) are devoted to this reduction and then the scalar value is written back to the accumulator register file (i.e., a different architected space from the vector register file) in stage 10 (ACC WB).

If a single thread issued instructions each cycle as in FIG. 2, bubbles would be induced in the pipeline. However, just as in the simplified case shown in FIG. 3 where there is only one type of pipeline, in the illustrative embodiment all five of the processor pipelines are interleaved and multithreaded to avoid bubbles. Each hardware thread unit issues up to three instructions in accordance with token triggered threading as shown in FIG. 5. This ensures that no threads stall and all threads will complete without deadlock.

As mentioned previously, in this implementation, all five processor pipelines may be simultaneously active with instructions from multiple hardware thread units. This fills potential bubbles in the pipeline with work from other thread units.

It should be noted that a given V_Mul Reduce pipeline may be shifted in locality from a V_Mul pipeline in that the back-to-back reduction operations of the V_Mul Reduce pipeline do not cause bubbles. It appears that such a shift might lead to pipeline bubbles because the V_Mul Reduce pipeline is longer in duration than the number of hardware thread units (eight in this implementation). In other words, the computational cycle of the pipeline (eleven clock cycles for V_Mul Reduce) is longer than the issue cycle (each thread gets to issue once every eight clock cycles). In fact, this does not happen because the accumulator register file read phase is shifted from the V_Mul pipeline computations.

FIG. 7 illustrates the manner in which multiple V_Mul Reduce pipelines can be shifted relative to one another so as to permit computation cycles which are longer than issue cycles. Note that the figure starts from cycle 5 of the first V_Mul Reduce instruction. Since there are eight thread units in this implementation, the next V_Mul Reduce instruction will issue on cycle 8. As can be seen in the figure, the accumulator register file is written back in cycle 10. The operands, however, are not read by the second instruction until cycle 13. The second V_Mul Reduce pipeline can be thought of as being shifted in locality from the first V_Mul Reduce pipeline. This allows the lengthening of execution phases without causing bubbles in the pipeline.

The illustrative embodiment described above advantageously allows multiple concurrent pipelines per thread and provides for pipeline shifting in deeply multithreaded pipelines. It also eliminates the need for dependency checking and bypassing hardware, since results are guaranteed to be written back to the register file before they are needed by the next instruction from the same thread.

It should be noted that the particular processor, multithreading, pipelining and shifting arrangements shown in the figures are presented by way of illustrative example only, and additional or alternative elements not explicitly shown may be included, as will be apparent to those skilled in the art.

It should also be emphasized that the present invention does not require the particular multithreaded processor configuration shown in FIG. 4. The invention can be implemented in a wide variety of other multithreaded processor configurations.

Thus, the above-described embodiments of the invention are intended to be illustrative only, and numerous alternative embodiments within the scope of the appended claims will be apparent to those skilled in the art. For example, the particular arrangement of hardware thread units, instruction decoder and execution units shown in FIG. 4 may be altered in other embodiments, and the invention should not be construed as requiring any particular type or arrangement of such elements. Also, as noted above, pipeline configurations, threading types and instruction formats may be varied to accommodate the particular needs of a given application. 

What is claimed is:
 1. A multithreaded processor comprising: means for permitting a thread to issue one or more instructions on a processor clock cycle; means for varying the thread permitted to issue instructions over a plurality of clock cycles in accordance with an instruction issuance sequence; and means for pipelining the instructions to permit the threads to support multiple concurrent instruction pipelines, wherein the pipelined instructions comprise at least a vector multiplication and reduction instruction that includes an instruction decode stage, a vector register file read stage, at least two multiply stages, at least two add stages, an accumulator read stage, a plurality of reduction stages, and an accumulator writeback stage; wherein the vector multiplication and reduction instruction is pipelined using a number of stages which is greater than a total number of threads of the processor; and wherein vector multiplication and reduction instruction pipelines are shifted relative to one another to permit computation cycles which are longer than issue cycles without forwarding logic to allow lengthening of execution phases without causing bubbles in the pipelines.
 2. The multithreaded processor of claim 1, wherein the means for permitting a thread to issue instructions includes a plurality of hardware thread units associated with respective threads.
 3. The multithreaded processor of claim 1, wherein the means for varying the thread permitted to issue instructions includes an instruction decoder coupled with a plurality of hardware thread units.
 4. The multithreaded processor of claim 1, wherein the means for pipelining the instructions includes a plurality of execution units.
 5. The multithreaded processor of claim 4, wherein the plurality of execution units are configured to execute all instructions decoded by the multithreaded processor.
 6. The multithreaded processor of claim 1, wherein a thread is permitted to issue two or more instructions on its corresponding processor clock cycle.
 7. The multithreaded processor of claim 1, wherein a thread is permitted to issue up to three instructions on its corresponding processor clock cycle.
 8. The multithreaded processor of claim 1, wherein the instructions are pipelined such that up to three instructions can be issued in a given clock cycle.
 9. The multithreaded processor of claim 1, wherein the instructions are pipelined such that separate instruction pipelines can be concurrently executing for different threads.
 10. The multithreaded processor of claim 1, wherein the pipelined instructions further comprise a load-store instruction, an arithmetic logic unit instruction, an integer multiplication instruction, and a vector multiplication instruction.
 11. The multithreaded processor of claim 10, wherein the vector multiplication instruction utilizes a different set of execution unit resources than the arithmetic logic unit and integer multiplication instructions.
 12. The multithreaded processor of claim 1, wherein the vector multiplication and reduction instruction comprises a pipeline with at least eleven stages.
 13. The multithreaded processor of claim 1, wherein the accumulator read stage is combined with one of the add stages.
 14. The multithreaded processor of claim 1, wherein pipelines for a first vector multiplication and reduction instruction and a second vector multiplication and reduction instruction are shifted relative to one another by a plurality of pipeline stages.
 15. The multithreaded processor of claim 1, wherein the pipelined instructions comprise a vector multiplication and reduction instruction having a pipeline with a computational cycle which is longer than an issue cycle of the multithreaded processor.
 16. The multithreaded processor of claim 1, wherein the number of threads is a minimum number to guarantee all state updates have occurred prior to subsequent instruction issue.
 17. The multithreaded processor of claim 1, wherein the multithreaded processor supports N threads, and over a sequence of N consecutive processor clock cycles each of the N threads is permitted to issue instructions on only a corresponding one of the N consecutive processor clock cycles.
 18. The multithreaded processor of claim 1, wherein the multithreaded processor comprises an integrated circuit.
 19. The multithreaded processor of claim 1, wherein the instruction issuance sequence is determined using token threaded triggering.
 20. The multithreaded processor of claim 1, wherein the form of token triggered threading employed corresponds to an arbitrary non-consecutive alternating even-odd sequence of threads. 